optim featur select improv medic diagnosi redund multicast rout multilay network share risk resourc group complex optim model algorithm sibl reconstruct genet marker combinatori reconstruct half dsibl group microsatellit data full sibl group reconstruct microsatellit data studi problem reconstruct half sibl group studi theoret challeng computation demand problem paper present formul half sibl reconstruct problem prove apx hard present exact solut formul develop heurist biolog synthet dataset present experiment result compar lead altern softwar coloni show result competit half sibl group reconstruct presenc polygami preval natur bound redund multicast rout problem srlg ddivers constraint edg approxim implicit cover problem biologi integ linear program rout protect problem optic network mathemat program data mine mathemat program approach fundament problem featur select cluster robust represent featur select problem consid discrimin set recogn irrelev redund featur suppress creat lean model gener unseen data comput result real data confirm improv gener leaner model cluster exemplifi unsupervis learn pattern cluster exist databas tool knowledg discoveri databas kdd mathemat program formul problem propos theoret justifi computation implement finit number step result median algorithm util discov surviv curv breast cancer patient medic databas robust represent concern minim train multi dquadrat integ program model applic quadrat integ program complex equival form determinist probabilist optim model data classif effici scalabl provis don multicast stream servic content list sciencedirect optimis data mine techniqu screen epilept patient integr product distribut problem bidirect flow approxim cover pack problem paper approxim issu problem triangl pack full sibl reconstruct maximum profit coverag coverag gener special version set cover applic biologi rang fullsibl reconstruct wild popul biomolecular cluster paper show approxim properti differ consider inapproxim constant triangl pack problem improv previou result directli transform inapproxim gap astad problem maxim number satisfi equat set equat gf interest approxim result full sibl reconstruct problem answer question pose berger wolf al result maximum profit coverag problem match upper lower bound approxim ratio answer question pose hassin support nsf grant ii support nsf grant dbi ii ii special issu combinatori optim data mine quadrat program approach time seri cluster biomed applic optim model abnorm brain activ classif reconstruct sibl relationship wild popul accid birth make peopl sister brother make sibl mutual parentag maya angel technolog collect genotyp data natur popul open possibl investig fundament biolog phenomena includ behavior mate system herit adapt trait kin select dispers pattern power potenti genotyp inform rest abil reconstruct genealog relationship individu relationship includ parentag full half sibship higher order aspect pedigre area genealog infer parentag studi extens method pedigre infer kinship analysi exist make assumpt hold wild popul anim plant chapter focu full sibl relationship review exist method full sibship reconstruct microsatellit genet marker describ combinatori method sibl reconstruct base simpl mendelian law extens presenc error data describ gener consensu method combin sibl reconstruct result method present experiment comparison exist approach biolog simul data discuss rel merit drawback exist method suggest practic approach reconstruct sibl relationship wild popul time seri dnearest neighbor classif abnorm brain activ path protect rout srlg constraint support iptv wdm mesh network electroencephalogram eeg time seri classif applic epilepsi seizur warn algorithm base optim nonlinear dynam linear techniqu multi dquadrat program problem statist inform approach model epilept brain analysi eeg data optim analysi eeg data optim grasp local search scheme vehicl rout problem time window 